Learning to Play Othello with N -Tuple Systems
نویسنده
چکیده
This paper investigates the use of n-tuple systems as position value functions for the game of Othello. The architecture is described, and then evaluated for use with temporal difference learning. Performance is compared with previously developed weighted piece counters and multi-layer perceptrons. The n-tuple system is able to defeat the best performing of these after just five hundred games of selfplay learning. The conclusion is that n-tuple networks learn faster and better than the other more conventional approaches.
منابع مشابه
Systematic N-tuple Networks for Position Evaluation: Exceeding 90% in the Othello League
N-tuple networks have been successfully used as position evaluation functions for board games such as Othello or Connect Four. The effectiveness of such networks depends on their architecture, which is determined by the placement of constituent n-tuples, sequences of board locations, providing input to the network. The most popular method of placing ntuples consists in randomly generating a sma...
متن کاملApplication of reinforcement learning to the game of Othello
Operations research and management science are often confronted with sequential decision making problems with large state spaces. Standard methods that are used for solving such complex problems are associated with some difficulties. As we discuss in this article, these methods are plagued by the so-called curse of dimensionality and the curse of modelling. In this article, we discuss reinforce...
متن کاملMachine Learning of Othello Heuristics
The machine learning algorithm of [3] is applied to the problem of learning which heuristics to apply when playing the board game Othello. The problem is large, for there are 46,875 heuristics considered. The results are respectable; the Learner is able to beat a practiced human player approximately fifty percent of the time. Suggestions for improvement are included.
متن کاملLearning Othello using Cooperative and Competitive Neuroevolution
From early days in computing, making computers play games like chess and Othello with a high level of skill has been a challenging and, lately, rewarding task. As computing power becomes increasingly more powerful, more and more complex learning techniques are employed to allow computers to learn different tasks. Games, however, remain a challenging and exciting domain for testing new technique...
متن کاملEffect of look-ahead search depth in learning position evaluation functions for Othello using epsilon-greedy exploration
This paper studies the effect of varying the depth of look-ahead for heuristic search in temporal difference (TD) learning and game playing. The acquisition position evaluation functions for the game of Othello is studied. The paper provides important insights into the strengths and weaknesses of using different search depths during learning when 2-greedy exploration is applied. The main findin...
متن کامل